On permanents of positive semidefinite matrices

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Permanents of Positive Semidefinite Hermitian Matrices

In this project, we are interested in approximating permanents of positive semidefinite Hermitian matrices. Specifically, we find conditions on positive semidefinite Hermitian matrices such that we can generalize the algorithm described in Sections 3.6 3.7 of [1] to matrices satisfying these conditions.

متن کامل

Singular value inequalities for positive semidefinite matrices

In this note‎, ‎we obtain some singular values inequalities for positive semidefinite matrices by using block matrix technique‎. ‎Our results are similar to some inequalities shown by Bhatia and Kittaneh in [Linear Algebra Appl‎. ‎308 (2000) 203-211] and [Linear Algebra Appl‎. ‎428 (2008) 2177-2191]‎.

متن کامل

singular value inequalities for positive semidefinite matrices

in this note‎, ‎we obtain some singular values inequalities for positive semidefinite matrices by using block matrix technique‎. ‎our results are similar to some inequalities shown by bhatia and kittaneh in [linear algebra appl‎. ‎308 (2000) 203-211] and [linear algebra appl‎. ‎428 (2008) 2177-2191]‎.

متن کامل

Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices

We build upon the work of Fukuda et al. [SIAM J. Optim., 11 (2001), pp. 647–674] and Nakata et al. [Math. Program., 95 (2003), pp. 303–327], in which the theory of partial positive semidefinite matrices was applied to the semidefinite programming (SDP) problem as a technique for exploiting sparsity in the data. In contrast to their work, which improved an existing algorithm based on a standard ...

متن کامل

On a Parametrization of Positive Semidefinite Matrices with Zeros

We study a class of parametrizations of convex cones of positive semidefinite matrices with prescribed zeros. Each such cone corresponds to a graph whose non-edges determine the prescribed zeros. Each parametrization in this class is a polynomial map associated with a simplicial complex supported on cliques of the graph. The images of the maps are convex cones, and the maps can only be surjecti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 1985

ISSN: 0024-3795

DOI: 10.1016/0024-3795(85)90089-8